Novel structures for optimal space partitions
نویسندگان
چکیده
منابع مشابه
Optimal Binary Space Partitions in the Plane
An optimal bsp for a set S of disjoint line segments in the plane is a bsp for S that produces the minimum number of cuts. We study optimal bsps for three classes of bsps, which differ in the splitting lines that can be used when partitioning a set of fragments in the recursive partitioning process: free bsps can use any splitting line, restricted bsps can only use splitting lines through pairs...
متن کاملOptimal Binary Space Partitions for Segments in the Plane
An optimal bsp for a set S of disjoint line segments in the plane is a bsp for S that produces the minimum number of cuts. We study optimal bsps for three classes of bsps, which differ in the splitting lines that can be used when partitioning a set of fragments in the recursive partitioning process: free bsps can use any splitting line, restricted bsps can only use splitting lines through pairs...
متن کاملA NOVEL FUZZY MULTI-OBJECTIVE ENHANCED TIME EVOLUTIONARY OPTIMIZATION FOR SPACE STRUCTURES
This research presents a novel design approach to achieve an optimal structure established upon multiple objective functions by simultaneous utilization of the Enhanced Time Evolutionary Optimization method and Fuzzy Logic (FLETEO). For this purpose, at first, modeling of the structure design problem in this space is performed using fuzzy logic concepts. Thus, a new problem creates with functio...
متن کاملOptimal Partitions for Eigenvalues
We introduce a new numerical method to approximate partitions of a domain minimizing the sum of Dirichlet-Laplacian eigenvalues of any order. First we prove the equivalence of the original problem and a relaxed formulation based on measures. Using this result, we build a numerical algorithm to approximate optimal configurations. We describe numerical experiments aimed at studying the asymptotic...
متن کاملPartitions for Optimal Approximations
The Riemann integral can be approximated using partitions and a rule for assigning weighted sums of the function at points determined by the partition. Approximation methods commonly used include endpoint rules, the midpoint rule, the trapezoid rule, Simpson’s rule, and other quadrature methods. The rate of approximation depends to a large degree on the rule being used and the smoothness of the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: New Journal of Physics
سال: 2016
ISSN: 1367-2630
DOI: 10.1088/1367-2630/18/10/103008